Segment tree - PDFSEARCH.IO - Document Search Engine

Segment tree
Results: 52

#	Item
11	CCCG 2011, Toronto ON, August 10–12, 2011 A Note on Minimum-Segment Drawings of Planar Graphs Stephane Durocher ∗† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Geometric graph theory Outerplanar graph Graph drawing Graph coloring Tree Graph Minimum spanning tree Path decomposition Angular resolution Graph theory Planar graphs Topological graph theory
12	CCCG 2011, Toronto ON, August 10–12, 2011 A Note on Minimum-Segment Drawings of Planar Graphs Stephane Durocher ∗† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Geometric graph theory Outerplanar graph Graph drawing Graph coloring Tree Graph Minimum spanning tree Path decomposition Angular resolution Graph theory Planar graphs Topological graph theory
13	CCCG 2011, Toronto ON, August 10–12, 2011 A Discrete and Dynamic Version of Klee’s Measure Problem Hakan Yıldız∗ John Hershberger† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Computing R-tree Segment tree K-d tree Measure B-tree Interval tree Fractional cascading Graph theory Binary trees Data management
14	Space-Efficient Algorithms for Klee’s Measure Problem Eric Y. Chen∗ Timothy M. Chan† rithm needs one priority queue and one segment tree Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:46 Segment tree K-d tree Bin Implicit data structure In-place algorithm Selection algorithm Priority queue H tree Algorithm Computing Mathematics Computer programming
15	CCCG 2010, Winnipeg MB, August 9–11, 2010 Range Aggregate Structures for Colored Geometric Objects. Saladi Rahul∗ Haritha Bellam† Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 Segment tree Computing Range searching Bin FO Lie groups Data management Mathematics Interval tree
16	CCCG 2011, Toronto ON, August 10–12, 2011 √ Bichromatic Line Segment Intersection Counting in O(n log n) Time Timothy M. Chan∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:16 Segment tree Line segment intersection Point location Sweep line algorithm Delaunay triangulation Computational geometry Differential topology Algebraic topology Fiber bundles Geometry Mathematics Binary trees
17	CCCG 2011, Toronto ON, August 10–12, 2011 A Discrete and Dynamic Version of Klee’s Measure Problem Hakan Yıldız∗ John Hershberger† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Computing R-tree Segment tree K-d tree Measure B-tree Interval tree Fractional cascading Graph theory Binary trees Data management
18	Obnoxious Facility Location: Complete Service with Minimal Harm Boaz Ben-Moshe, Matthew J. Katz, Michael Segal Department of Mathematics and Computer Science Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 16:01:48 Information science Discrete geometry Operations research Diagrams Voronoi diagram Point location Range searching Segment tree FO Mathematics Geometry Computational geometry
19	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 The Unified Segment Tree and its Application to the Rectangle Intersection Problem David P. Wagner∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:58 R-tree Computer programming Segment tree K-d tree H tree Tree Bin Rope Binary trees Computing Data management
20	IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. X, Add to Reading List Source URL: dbgroup.cs.tsinghua.edu.cn Language: English - Date: 2014-09-19 00:44:26 R-tree T-tree Pruning Tree Type–token distinction Segment tree Data management Binary trees Knowledge representation Graph theory

UPDATE